Progress in mathematical programming solvers from 2001 to 2020
نویسندگان
چکیده
This study investigates the progress made in lp and milp solver performance during last two decades by comparing software from beginning of millennium with codes available today. On average, we found out that for solving lp/milp, computer hardware got about 20 times faster, algorithms improved a factor nine around 50 milp, which gives total speed-up 180 1,000 times, respectively. However, these numbers have very high variance they considerably underestimate on algorithmic side: many problem instances can nowadays be solved within seconds, old are not able to solve any reasonable time.
منابع مشابه
Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
The eplex library of the ECLPS Constraint Logic Programming platform allows the integration of Mathematical Programming techniques with its native Constraint Logic Programming techniques within the same unified framework. It provides an interface to state-of-the-art Mathematical Programming solvers, and a set of programming primitives that allow ‘hybrid’ techniques to be easily expressed. This ...
متن کاملThe Countdown to 2020: measuring progress in neglected tropical diseases.
The London Declaration on Neglected Tropical Diseases1 marked its fourth year on Jan 30, 2016. The declaration represents a coordinate effort to control or eliminate ten of the neglected diseases by 2020, and has already led to important coordination and partnership, and mobilised considerable resources. Although the progress made so far is to be celebrated, now is the time to count down to 202...
متن کاملDARPA communicator evaluation: progress from 2000 to 2001
This paper describes the evaluation methodology and results of the DARPA Communicator spoken dialog system evaluation experiments in 2000 and 2001. Nine spoken dialog systems in the travel planning domain participated in the experiments resulting in a total corpus of 1904 dialogs. We describe and compare the experimental design of the 2000 and 2001 DARPA evaluations. We describe how we establis...
متن کاملRelationship to Mathematical Programming
Arising from research in the computer science community, constraint programming is a relatively new technique for solving optimization problems. For those familiar with mathematical programming, there are a number of language barriers that exist that make it difficult to understand the concepts of constraint programming. This paper, which assumes a minimal background in linear and integer progr...
متن کاملProgress in developing Poisson-Boltzmann equation solvers.
This review outlines the recent progress made in developing more accurate and efficient solutions to model electrostatics in systems comprised of bio-macromolecules and nano-objects, the last one referring to objects that do not have biological function themselves but nowadays are frequently used in biophysical and medical approaches in conjunction with bio-macromolecules. The problem of modeli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO journal on computational optimization
سال: 2022
ISSN: ['2192-4406', '2192-4414']
DOI: https://doi.org/10.1016/j.ejco.2022.100031